Extension of HPL to complex arguments

Extension of HPL to complex arguments

In this paper we describe the extension of the Mathematica package HPL to treat harmonic polylogarithms of complex arguments. The harmonic polylogarithms have been introduced by Remiddi and Vermaseren [1] and have many applications in high energy particle physics.

Complex version of high performance computing LINPACK benchmark (HPL)

This paper describes our effort to enhance the performance of the AORSA fusion energy simulation program through the use of High Performance LINPACK (HPL) benchmark, commonly used in ranking the top 500 supercomputers. The algorithm used by HPL, enhanced by a set of tuning options, is more effective than that found in the ScaLAPACK library. Retrofitting these algorithms, such as look-ahead proc...

Preferred Arguments are Harder to Compute than Stable Extension

Based on an abstract framework for nonmonotonic reasoning, Bondarenko et at. have extended the logic programming semantics of admissible and preferred arguments to other nonmonotonic formalisms such as circumscription, autoepisternic logic and default logic. Although the new semantics have been tacitly assumed to mitigate the computational problems of nonmonotonic reasoning under the standard s...

Stirling Numbers for Complex Arguments

We define the Stirling numbers for complex values and obtain extensions of certain identities involving these numbers. We also show that the generalization is a natural one for proving unimodality and monotonicity results for these numbers. The definition is based on the Cauchy integral formula and can be used for many other combinatorial numbers.

Part II Extension to More Complex Changes